Componentwise Perturbation Theory for Linear Systems With Multipte Right-Hand Sides
نویسندگان
چکیده
Existing definitions of componentwise backward error and componentwise condi tion number for linear systems are extended to systems with multiple right-hand sides and to a general class of componentwise measure of perturbations involving Holder p-norms. It is shown that for a system of order n with r right-hand sides, the componentwise backward error can be computed by finding the minimum p-norm solutions to n underdetermined linear systems, and an explicit expression is obtained in the case r = 1. A perturbation bound is derived, and from this the componentwise condition number is obtained to within a multiplicative constant. Applications of the results are discussed to invariant subspace computations, quasi-Newton methods based on multiple secant equations, and an inverse ODE problem. *Supported by the University of Dundee Research Initiatives Fund. E-mail: [email protected]. tE-mail: na. nhigham@na net. ornl . gov. LINEAR ALGEBRA AND ITS APPLZCATZONS 174: 11 l129 (1992) Q Elsevier Science Publishing Co., Inc., 1992 111 655 Avenue of the Americas, New York, NY 10010 0024-3795/92/$5.00 112 DESMOND J. HIGHAM AND NICHOLAS J. HIGHAM
منابع مشابه
New variants of the global Krylov type methods for linear systems with multiple right-hand sides arising in elliptic PDEs
In this paper, we present new variants of global bi-conjugate gradient (Gl-BiCG) and global bi-conjugate residual (Gl-BiCR) methods for solving nonsymmetric linear systems with multiple right-hand sides. These methods are based on global oblique projections of the initial residual onto a matrix Krylov subspace. It is shown that these new algorithms converge faster and more smoothly than the Gl-...
متن کاملSurvey of Componentwise Perturbation Theory
Perturbation bounds in numerical linear algebra are traditionally derived and expressed using norms. Norm bounds cannot reeect the scaling or sparsity of a problem and its perturbation, and so can be unduly weak. If the problem data and its perturbation are measured componentwise, much smaller and more revealing bounds can be obtained. A survey is given of componentwise perturbation theory in n...
متن کاملA Survey of Componentwise Perturbation Theory
Perturbation bounds in numerical linear algebra are traditionally derived and expressed using norms. Norm bounds cannot reflect the scaling or sparsity of a problem and its perturbation, and so can be unduly weak. If the problem data and its perturbation are measured componentwise, much smaller and more revealing bounds can be obtained. A survey is given of componentwise perturbation theory in ...
متن کاملA Survey of Componentwise Perturbation Theory in Numerical Linear Algebra
Perturbation bounds in numerical linear algebra are traditionally derived and expressed using norms. Norm bounds cannot reflect the scaling or sparsity of a problem and its perturbation, and so can be unduly weak. If the problem data and its perturbation are measured componentwise, much smaller and more revealing bounds can be obtained. A survey is given of componentwise perturbation theory in ...
متن کاملBounds and Invariant Sets for a Class of Switching Systems with Delayed-state-dependent Perturbations
We present a novel method to compute componentwise transient bounds, componentwise ultimate bounds, and invariant regions for a class of switching continuous-time linear systems with perturbation bounds that may depend nonlinearly on a delayed state. The main advantage of the method is its componentwise nature, i.e. the fact that it allows each component of the perturbation vector to have an in...
متن کامل